Interpolation and FEP for logics of residuated algebras
نویسنده
چکیده
A residuated algebra (RA) is a generalization of a residuated groupoid; instead of one basic binary operation · with residual operations \, /, it admits finitely many basic operations, and each n−ary basic operation is associated with n residual operations. A logical system for RAs was studied in e.g. [6, 8, 16, 15] under the name: Generalized Lambek Calculus GL. In this paper we study GL and its extensions in the form of sequent systems. We prove an interpolation property which allows to replace a substructure of the antecedent structure by a single formula in a provable sequent. Together with model constructions, based on nuclei [13], interpolation leads to proofs of Finite Embeddability Property for different classes of RAs, as e.g. all RAs, distributive lattice-ordered RAs, boolean RAs, Heyting RAs and double RAs.
منابع مشابه
Semisimplicity, Amalgamation Property and Finite Embeddability Property of Residuated Lattices
In this thesis, we study semisimplicity, amalgamation property and finite embeddability property of residuated lattices. We prove semisimplicity and amalgamation property of residuated lattices which are of purely algebraic character, by using proof-theoretic methods and results of substructural logics. On the other hand, we show the finite model property (FMP) for various substructural logics,...
متن کاملAlgebra and Substructural Logics – Take Schedule and Abstracts
09:20 09:30 Opening 09:30 10:10 Daniele Mundici Deductive interpolation in Łukasiewicz logic and amalgamation of MV-algebras 10:10 10:50 George Metcalfe Craig Interpolation for Semilinear Varieties 10:50 11:20 Break 11:20 12:00 Leonardo Cabrer, José Gil-Férez Leibniz Interpolation Properties 12:00 12:40 小野寛晰 (Hiroakira Ono) Regular completions of residuated lattices 12:40 14:10 Lunch break 14:1...
متن کاملFiniteness Properties for Idempotent Residuated Structures
A class K of similar algebras is said to have the finite embeddability property (briefly, the FEP) if every finite subset of an algebra in K can be extended to a finite algebra in K, with preservation of all partial operations. If a finitely axiomatized variety or quasivariety of finite type has the FEP, then its universal first order theory is decidable, hence its equational and quasi-equation...
متن کاملCombinatorics of Interpolation in Gödel Logic
We investigate the combinatorics of interpolation in Gödel logic, the propositional logic whose algebraic semantics is the variety of Heyting algebras generated by chains. 1 Motivation In recent work, Busaniche and Mundici prove that Lukasiewicz logic has the Robinson property RP [4], exploiting the geometry of prime filters in the free finitely generated MV-algebra. In this note we recast thei...
متن کاملOrdered Algebras and Logic
Ordered algebras such as Boolean algebras, Heyting algebras, lattice-ordered groups, and MV-algebras have long played a decisive role in logic, although perhaps only in recent years has the significance of the relationship between the two fields begun to be fully recognized and exploited. The first aim of this survey article is to briefly trace the distinct historical roots of ordered algebras ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logic Journal of the IGPL
دوره 19 شماره
صفحات -
تاریخ انتشار 2011